Heuristic based track maintenance scheduling optimisation

نویسندگان

  • L. Quiroga
  • M. Antoni
  • E. Schnieder
چکیده

The maintenance of railway track is highly relevant for the service quality and safety. This task demands huge technical and human resources. Therefore an optimal deployment of the available resources is crusial for the cost-effectiveness of railway operation. Furthermore, the track geometry maintenance activities need to be planned up to two years in advance. For this reason the French railway operator SNCF measures periodically the geometrical characteristics of its high speed network since its commissioning, i.e. for more than 30 years now. Maintenance planning is based on forecastings of the development of the geometry irregularities in each track sector. In order to achieve good forecasting quality and reliability, this paper presents a method for making middle term (i.e. up to one year) predictions of the railway geometry ageing process. The method relies on a process model describing the track geometry ageing as an exponential function. The function identification is achieved with the help of the Levenberg-Marquardt procedure for sum of squares minimisation of non-linear functions. One of the most important maintenance activities, which is basically achieved by means of tamping and grinding, is the reduction of the track geometry irregularities. Currently, most the planning of tamping interventions is made manually, basing on expert knowledge and analysis of the geometry degradation. In this paper we present a method for automatic optimal planning and scheduling of tamping activities on railway tracks. Implementing the method would entail a more efficient use of the available maintenance resources, leading to an overall improvement of the track geometry condition. The maintenance scheduling is calculated by means of an in-house developed optimisation algorithm. Its main novel aspect is the implementation of a heuristic for the problem resolution instead of commercial optimization packages. This results in a twofold benefit, as both the need of model simplification and the calculation times are dramatically reduced. The method is finally validated by means of a case study on real data of a French TGV high speed line.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Solution for the Cyclic Multiple-Part Type Three-Machine Robotic Cell Problem based on the Particle Swarm Meta-heuristic

In this paper, we develop a new mathematical model for a cyclic multiple-part type threemachine robotic cell problem. In this robotic cell a robot is used for material handling. The objective is finding a part sequence to minimize the cycle time (i.e.; maximize the throughput) with assumption of known robot movement. The developed model is based on Petri nets and provides a new method to calcul...

متن کامل

A heuristic approach to railway track maintenance scheduling

Travelling safely and comfortably on high speed railway lines requires excellent conditions of the whole railway infrastructure in general and of the railway track geometry in particular. The maintenance process required to achieve such excellent conditions is largely complex and expensive, demanding an increased amount of both human and technical resources. In this framework, an optimal schedu...

متن کامل

An incremental decision algorithm for railway traffic optimisation in a complex station

In heavy traffic nodes of rail networks, as in main stations, conflicts and subsequent train delays greatly propagate during operations. A disturbance which is at origin only a few seconds long can quickly lead to other delays of over five minutes. To limit this phenomenon, newmethods andmodels are necessary to optimise the use of scarce resources like platforms and track sections. The operator...

متن کامل

Strategic Gang Scheduling for Railroad Maintenance

We address the railway track maintenance scheduling problem. The problem stems from the significant percentage of the annual budget invested by the railway industry for maintaining its railway tracks. The process requires consideration of human resource allocations (gangs), as well as effective logistics for equipment movement and routing around the rail network under time window constraints. W...

متن کامل

Column Generation Heuristic for a Rich Arc Routing Problem

In this paper we address a real world optimisation problem, the Rail Track Inspection Scheduling Problem (RTISP). This problem consists of scheduling network inspection tasks. The objective is to minimise total deadhead distance. A mixed integer formulation of the problem is presented. A column generation based algorithm is proposed to solve this rich arc routing problem. Its performance is ana...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011